package LeetCode;

/**
 * @Author: fzykd
 * Date: 2024-04-15
 * Time: 16:37
 * User: LQH
 */


public class MaxSub {
    public static int maxSubArray(int[] nums) {

        //数组一个元素
        if (nums.length == 1) {
            return nums[0];
        }

        //数组两个元素
        if (nums.length == 2) {
            return nums[0] + nums[1];
        }

        int two = nums[0] + nums[1];
        int max = nums[0] + nums[1];
        for (int i = 2; i < nums.length - 1; i++) {

        }


        return -1;

    }

}
